Hydrological determination of hierarchical clustering scheme by using small experimental matrix
نویسندگان
چکیده
In this investigation we tested the performance of the five available hierarchical clustering algorithms and nine distance metrics. An arbitrarily chosen experimental matrix (6x3) is used in this analysis to evaluate 45 clustering schemes using dendrogram and cophonet coefficient index. Priori knowledge of cluster dispersion was the key element to determine non-useful cluster structures. The Euclidean metric and Wards method combination is most preferred to define homogenous clusters in hydrological studies; however, Mahalanobis metric-Average Linkage method combination was emerged with a higher cophonet index, 0.90420 in this study. The most efficient grouping was achieved by the use of City Block and Euclidean metrics in all combinations while the other distance metrics resulted in a non-interpretable dendrogram. Major dendrogram plots and the cophonet index values are presented for visual comparison. 1 PhD Student, Istanbul Technical University, Institute of Science and Technology, 34469 Maslak Istanbul, Turkey 2 Rosenstiel School of Marine and Atmospheric Sciences, Division of Meteorology and Physical Oceanography (RSMAS/MPO), University of Miami, Miami, Florida, USA 3 Assoc. Prof., Hydraulic Division Civil Engineering Department Istanbul Technical University 34469 Maslak Istanbul, Turkey Tel: + 90 (212) 285-3002 e-mail: [email protected]
منابع مشابه
Determination of the Best Hierarchical Clustering Method for Regional Analysis of Base Flow Index in Kerman Province Catchments
The lack of complete coverage of hydrological data forces hydrologists to use the homogenization methods in regional analysis. In this research, in order to choose the best Hierarchical clustering method for regional analysis, base flow and related index were extracted from daily stream flow data using two parameter recursive digital filters in 43 hydrometric stations of the Kerman province. Ph...
متن کاملHigh-Dimensional Unsupervised Active Learning Method
In this work, a hierarchical ensemble of projected clustering algorithm for high-dimensional data is proposed. The basic concept of the algorithm is based on the active learning method (ALM) which is a fuzzy learning scheme, inspired by some behavioral features of human brain functionality. High-dimensional unsupervised active learning method (HUALM) is a clustering algorithm which blurs the da...
متن کاملGraph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کاملDetermination of weight vector by using a pairwise comparison matrix based on DEA and Shannon entropy
The relation between the analytic hierarchy process (AHP) and data envelopment analysis (DEA) is a topic of interest to researchers in this branch of applied mathematics. In this paper, we propose a linear programming model that generates a weight (priority) vector from a pairwise comparison matrix. In this method, which is referred to as the E-DEAHP method, we consider each row of the pairwise...
متن کاملAssessment of the Performance of Clustering Algorithms in the Extraction of Similar Trajectories
In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...
متن کامل